Search results for "Geometric primitive"

showing 4 items of 4 documents

Hybrid architecture for shape reconstruction and object recognition

1998

The proposed architecture is aimed to recover 3-D- shape information from gray-level images of a scene; to build a geometric representation of the scene in terms of geometric primitives; and to reason about the scene. The novelty of the architecture is in fact the integration of different approaches: symbolic reasoning techniques typical of knowledge representation in artificial intelligence, algorithmic capabilities typical of artificial vision schemes, and analogue techniques typical of artificial neural networks. Experimental results obtained by means of an implemented version of the proposed architecture acting on real scene images are reported to illustrate the system capabilities.

Artificial neural networkKnowledge representation and reasoningComputer sciencebusiness.industryComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISIONCognitive neuroscience of visual object recognitionImage processingTheoretical Computer ScienceHuman-Computer InteractionArtificial IntelligenceComputer Science::Computer Vision and Pattern RecognitionPattern recognition (psychology)Systems architectureComputer visionGeometric primitiveArtificial intelligenceGraphicsbusinessSoftware
researchProduct

Exact, efficient, and complete arrangement computation for cubic curves

2006

AbstractThe Bentley–Ottmann sweep-line method can compute the arrangement of planar curves, provided a number of geometric primitives operating on the curves are available. We discuss the reduction of the primitives to the analysis of curves and curve pairs, and describe efficient realizations of these analyses for planar algebraic curves of degree three or less. We obtain a complete, exact, and efficient algorithm for computing arrangements of cubic curves. Special cases of cubic curves are conics as well as implicitized cubic splines and Bézier curves.The algorithm is complete in that it handles all possible degeneracies such as tangential intersections and singularities. It is exact in t…

Discrete mathematicsArrangementsControl and OptimizationComputationAlgebraic curvesMathematical analysisBézier curveSweep line algorithmComputer Science ApplicationsModuli of algebraic curvesComputational MathematicsGeometric designComputational Theory and MathematicsFamily of curvesSweep-line algorithmExact geometric computationGeometric primitiveAlgebraic curveGeometry and TopologyRobustnessComputingMethodologies_COMPUTERGRAPHICSMathematicsComputational Geometry
researchProduct

A Neural Architecture for Segmentation and Modelling of Range Data

2003

A novel, two stage, neural architecture for the segmentation of range data and their modeling with undeformed superquadrics is presented. The system is composed by two distinct neural stages: a SOM is used to perform data segmentation, and, for each segment, a multi-layer feed-forward network performs model estimation. The topology preserving nature of the SOM algorithm makes this architecture suited to cluster data with respect to sudden curvature variations. The second stage is designed to model and compute the inside-outside function of an undeformed superquadric in whatever attitude, starting form the (x, y, z) data triples. The network has been trained using backpropagation, and the we…

Robot visionArtificial neural networkComputer sciencesuperquadricsPattern recognition (psychology)SuperquadricsCognitive neuroscience of visual object recognitionSegmentationGeometric primitiveCurvatureVisual servoingAlgorithmBackpropagation
researchProduct

Extending CSG with projections: Towards formally certified geometric modeling

2015

We extend traditional Constructive Solid Geometry (CSG) trees to support the projection operator. Existing algorithms in the literature prove various topological properties of CSG sets. Our extension readily allows these algorithms to work on a greater variety of sets, in particular parametric sets, which are extensively used in CAD/CAM systems. Constructive Solid Geometry allows for algebraic representation which makes it easy for certification tools to apply. A geometric primitive may be defined in terms of a characteristic function, which can be seen as the zero-set of a corresponding system along with inequality constraints. To handle projections, we exploit the Disjunctive Normal Form,…

[ INFO ] Computer Science [cs]Disjoint setsDisjunctive normal formIndustrial and Manufacturing EngineeringProjection (linear algebra)Interval arithmeticConstructive solid geometryConstructive solid geometry[INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI][INFO.INFO-RB]Computer Science [cs]/Robotics [cs.RO]Homotopy equivalenceGeometric primitiveBinary expression tree[INFO]Computer Science [cs]ProjectionComputingMilieux_MISCELLANEOUSMathematicsDiscrete mathematics[INFO.INFO-DB]Computer Science [cs]/Databases [cs.DB]HomotopyFormal methodsDisjunctive normal formComputer Graphics and Computer-Aided Design[INFO.INFO-GR]Computer Science [cs]/Graphics [cs.GR]Computer Science ApplicationsAlgebra[INFO.INFO-TI]Computer Science [cs]/Image Processing [eess.IV][INFO.INFO-DC]Computer Science [cs]/Distributed Parallel and Cluster Computing [cs.DC]
researchProduct